A Program That Learns to Solve Rubik's Cube
نویسنده
چکیده
This paper dcscribcs a program which learns efficient strategies for solving problems such as Rubik’s cube and the eight puzzle. It uses a new gcncral problem solving method based on macro-operators. The strategies learned by the program are equal to or superior to strategies used by humans on these problems, in terms of number of moves rcquircd for solution.
منابع مشابه
Twenty-Five Moves Suffice for Rubik's Cube
How many moves does it take to solve Rubik’s Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a program that is able to find solutions of length 20 or less at a rate of more than 16 million positions a second. We use this program, along with some new id...
متن کاملHarnessing parallel disks to solve Rubik's cube
The number ofmoves required to solve any configuration of Rubik’s cube has held a fascination for over 25 years. A new upper bound of 26 is produced. More important, a new methodology is described for finding upper bounds. The novelty is two-fold. First, parallel disks are employed. This allows 1.4 × 1012 states representing symmetrized cosets to be enumerated in seven terabytes. Second, a fast...
متن کاملZero Knowledge with Rubik's Cubes
Since the invention of the Rubik’s cube by Ernö Rubik in 1974, similar puzzles have been produced, with various number of faces or stickers. We can use these toys to define several problems in computer science, such as go from one state of the puzzle to another one. In this paper, we will classify some of these problems based on the classic Rubik’s cube or on generalized Rubik’s Cube. And we wi...
متن کاملGroup Theory and the Rubik’s Cube
A Note to the Reader These notes are based on a 2-week course that I taught for high school students at the Texas State Honors Summer Math Camp. All of the students in my class had taken elementary number theory at the camp, so I have assumed in these notes that readers are familiar with the integers mod n as well as the units mod n. Because one goal of this class was a complete understanding o...
متن کاملFinding Optimal Solutions to Rubik's Cube Using Pattern Databases
We have found the first optimal solutions to random instances of Rubik’s Cube. The median optimal solution length appears to be 18 moves. The algorithm used is iterative-deepening-A* (IDA*), with a lowerbound heuristic function based on large memory-based lookup tables, or “pattern databases” (Culberson and Schaeffer 1996). These tables store the exact number of moves required to solve various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1982